ar X iv : 1 10 7 . 18 93 v 1 [ cs . D M ] 1 0 Ju l 2 01 1 Benchmarking ordering techniques for nonserial dynamic programming ∗
نویسنده
چکیده
Five ordering algorithms for the nonserial dynamic programming algorithm for solving sparse discrete optimization problems are compared in this paper. The benchmarking reveals that the ordering of the variables has a significant impact on the run-time of these algorithms. In addition, it is shown that different orderings are most effective for different classes of problems. Finally, it is shown that, amongst the algorithms considered here, heuristics based on maximum cardinality search and minimum fill-in perform best for solving the discrete optimization problems considered in this paper.
منابع مشابه
Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers
In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include O (m)-time algorithms for (1 − )maximum weight f -factor and (1+ )-approximate minimum weight f -edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in O(m √ f(V )) time. The technic...
متن کاملOn Integer Programming and the Path-width of the Constraint Matrix
We use the Exponential Time and Strong Exponential Time hypotheses (ETH & SETH) to provide conditional lower bounds on the solvability of the integer programming (IP) problem. We provide evidence that the running times of known pseudo-polynomial time algorithms solving IP, when the number of constraints is a constant [Papadimitriou, J. ACM 1981] and when the branch-width of the corresponding co...
متن کاملSynthetic Language Generation and Model Validation in BEAST2
Generating synthetic languages aids in the testing and validation of future computational linguistic models and methods. This thesis extends the BEAST2 phylogenetic framework to add linguistic sequence generation under multiple models. The new plugin is then used to test the effects of the phenomena of word borrowing on the inference process under two widely used phylolinguistic models. ar X iv...
متن کاملDoubly Balanced Connected Graph Partitioning
We introduce and study the Doubly Balanced Connected graph Partitioning (DBCP) problem: Let G=(V,E) be a connected graph with a weight (supply/demand) function p:V→ {−1,+1} satisfying p(V )= ∑ j∈V p(j)=0. The objective is to partition G into (V1, V2) such that G[V1] and G[V2] are connected, |p(V1)|, |p(V2)|≤cp, and max{ |V1| |V2| , |V2| |V1|}≤cs, for some constants cp and cs. When G is 2-connec...
متن کاملar X iv : h ep - l at / 0 01 20 10 v 1 7 D ec 2 00 0 1 The Vacuum Polarization : Power Corrections beyond OPE ? ∗
X iv :h ep -l at /0 01 20 10 v1 7 D ec 2 00 0 1 The Vacuum Polarization: Power Corrections beyond OPE ? ∗ M. Göckeler, R. Horsley, W. Kürzinger, V. Linke, D. Pleiter, P. E. L. Rakow and G. Schierholz Institut für Theoretische Physik, Universität Regensburg, D-93040 Regensburg, Germany Deutsches Elektronen-Synchrotron DESY & NIC, D-15735 Zeuthen, Germany Institut für Physik, Humboldt-Universität...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011